KERALA UNIVERSITY Class 4 formal languages and automata theory Question Paper 2019

Practice authentic previous year questions for better exam preparation.

Sample Questions

(b) Design a Turing machine that computes a function $f(m, n)=m \div n$, i.e. proper subtraction of 2 integers defined as $m \div n$ if $m>n$ and 0 otherwise.
Design a Turing machine to multiply two numbers.
(a) Explain Universal Turing machine.
(b) Remove useless symbols of the CFG given below and convert to Chomsky Normal form. $s \rightarrow 0 A 0 / 1 B 1 / B B \quad A \rightarrow C \quad B \rightarrow S / A \quad C \rightarrow S / \varepsilon$ Module - IV
(b) Check the ambiguity in $S \rightarrow a B / b A \quad A \rightarrow a / a S / b A A \quad B \rightarrow b / b S / a B B . \quad 10$